The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

0 CpxTRS
↳1 RenamingProof (⇔, 0 ms)
↳2 CpxRelTRS
↳3 TypeInferenceProof (BOTH BOUNDS(ID, ID), 0 ms)
↳4 typed CpxTrs
↳5 OrderProof (LOWER BOUND(ID), 0 ms)
↳6 typed CpxTrs
↳7 RewriteLemmaProof (LOWER BOUND(ID), 406 ms)
↳8 BEST
    ↳9 typed CpxTrs
        ↳10 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
        ↳11 typed CpxTrs
        ↳12 LowerBoundsProof (⇔, 0 ms)
        ↳13 BOUNDS(n^1, INF)
    ↳14 typed CpxTrs
        ↳15 LowerBoundsProof (⇔, 0 ms)
        ↳16 BOUNDS(n^1, INF)

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

minus(minus(x)) → x
minus(+(x, y)) → *(minus(minus(minus(x))), minus(minus(minus(y))))
minus(*(x, y)) → +(minus(minus(minus(x))), minus(minus(minus(y))))
f(minus(x)) → minus(minus(minus(f(x))))

Rewrite Strategy: FULL

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

minus(minus(x)) → x
minus(+'(x, y)) → *'(minus(minus(minus(x))), minus(minus(minus(y))))
minus(*'(x, y)) → +'(minus(minus(minus(x))), minus(minus(minus(y))))
f(minus(x)) → minus(minus(minus(f(x))))

S is empty.
Rewrite Strategy: FULL

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

TRS:
Rules:
minus(minus(x)) → x
minus(+'(x, y)) → *'(minus(minus(minus(x))), minus(minus(minus(y))))
minus(*'(x, y)) → +'(minus(minus(minus(x))), minus(minus(minus(y))))
f(minus(x)) → minus(minus(minus(f(x))))

Types:
minus :: +':*' → +':*'
+' :: +':*' → +':*' → +':*'
*' :: +':*' → +':*' → +':*'
f :: +':*' → +':*'
hole_+':*'1_0 :: +':*'
gen_+':*'2_0 :: Nat → +':*'

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
minus, f

They will be analysed ascendingly in the following order:
minus < f

(6) Obligation:

TRS:
Rules:
minus(minus(x)) → x
minus(+'(x, y)) → *'(minus(minus(minus(x))), minus(minus(minus(y))))
minus(*'(x, y)) → +'(minus(minus(minus(x))), minus(minus(minus(y))))
f(minus(x)) → minus(minus(minus(f(x))))

Types:
minus :: +':*' → +':*'
+' :: +':*' → +':*' → +':*'
*' :: +':*' → +':*' → +':*'
f :: +':*' → +':*'
hole_+':*'1_0 :: +':*'
gen_+':*'2_0 :: Nat → +':*'

Generator Equations:
gen_+':*'2_0(0) ⇔ hole_+':*'1_0
gen_+':*'2_0(+(x, 1)) ⇔ +'(hole_+':*'1_0, gen_+':*'2_0(x))

The following defined symbols remain to be analysed:
minus, f

They will be analysed ascendingly in the following order:
minus < f

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
minus(gen_+':*'2_0(n4_0)) → *3_0, rt ∈ Ω(n40)

Induction Base:
minus(gen_+':*'2_0(0))

Induction Step:
minus(gen_+':*'2_0(+(n4_0, 1))) →RΩ(1)
*'(minus(minus(minus(hole_+':*'1_0))), minus(minus(minus(gen_+':*'2_0(n4_0))))) →RΩ(1)
*'(minus(hole_+':*'1_0), minus(minus(minus(gen_+':*'2_0(n4_0))))) →IH
*'(minus(hole_+':*'1_0), minus(minus(*3_0)))

We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

TRS:
Rules:
minus(minus(x)) → x
minus(+'(x, y)) → *'(minus(minus(minus(x))), minus(minus(minus(y))))
minus(*'(x, y)) → +'(minus(minus(minus(x))), minus(minus(minus(y))))
f(minus(x)) → minus(minus(minus(f(x))))

Types:
minus :: +':*' → +':*'
+' :: +':*' → +':*' → +':*'
*' :: +':*' → +':*' → +':*'
f :: +':*' → +':*'
hole_+':*'1_0 :: +':*'
gen_+':*'2_0 :: Nat → +':*'

Lemmas:
minus(gen_+':*'2_0(n4_0)) → *3_0, rt ∈ Ω(n40)

Generator Equations:
gen_+':*'2_0(0) ⇔ hole_+':*'1_0
gen_+':*'2_0(+(x, 1)) ⇔ +'(hole_+':*'1_0, gen_+':*'2_0(x))

The following defined symbols remain to be analysed:
f

(10) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol f.

(11) Obligation:

TRS:
Rules:
minus(minus(x)) → x
minus(+'(x, y)) → *'(minus(minus(minus(x))), minus(minus(minus(y))))
minus(*'(x, y)) → +'(minus(minus(minus(x))), minus(minus(minus(y))))
f(minus(x)) → minus(minus(minus(f(x))))

Types:
minus :: +':*' → +':*'
+' :: +':*' → +':*' → +':*'
*' :: +':*' → +':*' → +':*'
f :: +':*' → +':*'
hole_+':*'1_0 :: +':*'
gen_+':*'2_0 :: Nat → +':*'

Lemmas:
minus(gen_+':*'2_0(n4_0)) → *3_0, rt ∈ Ω(n40)

Generator Equations:
gen_+':*'2_0(0) ⇔ hole_+':*'1_0
gen_+':*'2_0(+(x, 1)) ⇔ +'(hole_+':*'1_0, gen_+':*'2_0(x))

No more defined symbols left to analyse.

(12) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
minus(gen_+':*'2_0(n4_0)) → *3_0, rt ∈ Ω(n40)

(13) BOUNDS(n^1, INF)

(14) Obligation:

TRS:
Rules:
minus(minus(x)) → x
minus(+'(x, y)) → *'(minus(minus(minus(x))), minus(minus(minus(y))))
minus(*'(x, y)) → +'(minus(minus(minus(x))), minus(minus(minus(y))))
f(minus(x)) → minus(minus(minus(f(x))))

Types:
minus :: +':*' → +':*'
+' :: +':*' → +':*' → +':*'
*' :: +':*' → +':*' → +':*'
f :: +':*' → +':*'
hole_+':*'1_0 :: +':*'
gen_+':*'2_0 :: Nat → +':*'

Lemmas:
minus(gen_+':*'2_0(n4_0)) → *3_0, rt ∈ Ω(n40)

Generator Equations:
gen_+':*'2_0(0) ⇔ hole_+':*'1_0
gen_+':*'2_0(+(x, 1)) ⇔ +'(hole_+':*'1_0, gen_+':*'2_0(x))

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
minus(gen_+':*'2_0(n4_0)) → *3_0, rt ∈ Ω(n40)

(16) BOUNDS(n^1, INF)